#
# @lc app=leetcode.cn id=300 lang=python3
#
# [300] 最长递增子序列
#

# @lc code=start
class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
        n = len(nums)
        # n = len(s2)
        dp = [[1 for i in range(n)] for j in range(n)]
        for i in range(1, n, 1):
            for j in range(1, n, 1):
                dp[i][j] = max()
# @lc code=end

